Implementing fanout, parity, and Mod gates via spin exchange interactions

نویسندگان

  • Stephen A. Fenner
  • Yong Zhang
چکیده

We show that, for any n > 0, the Heisenberg interaction among 2n qubits (as spin-1/2 particles) can be used to exactly implement an n-qubit parity gate, which is equivalent in constant depth to an n-qubit fanout gate. Either isotropic or nonisotropic versions of the interaction can be used. We generalize our basic results by showing that any Hamiltonian (acting on suitably encoded logical qubits), whose eigenvalues depend quadratically on the Hamming weight of the logical qubit values, can be used to implement generalized Modq gates for any q ≥ 2. This paper is a sequel to quant-ph/0309163, and resolves a question left open in that paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Circuits: Fanout, Parity, and Counting

We propose definitions of QAC, the quantum analog of the classical class AC of constant-depth circuits with AND and OR gates of arbitrary fan-in, and QACC[q], where n-ary MODq gates are also allowed. We show that it is possible to make a ‘cat’ state on n qubits in constant depth if and only if we can construct a parity or MOD2 gate in constant depth; therefore, any circuit class that can fan ou...

متن کامل

Quantum lower bounds for fanout

We consider the resource bounded quantum circuit model with circuits restricted by the number of qubits they act upon and by their depth. Focusing on natural universal sets of gates which are familiar from classical circuit theory, several new lower bounds for constant depth quantum circuits are proved. The main result is that parity (and hence fanout) requires log depth quantum circuits, when ...

متن کامل

The Correlation Between Parity and Quadratic Polynomials

We prove exponentially small upper bounds on the correlation between parity and quadratic polynomials mod 3. One corollary of this is that in order to compute parity, circuits consisting of a threshold gate at the top, mod 3 gates in the middle, and AND gates of fan-in two at the inputs must be of size 2. This is the first result of this type for general mod 3 subcircuits with ANDs of fan-in gr...

متن کامل

Implementing the fanout gate by a Hamiltonian

We show that, for even n, evolving n qubits according to a simple Hamiltonian can be used to exactly implement an (n + 1)-qubit parity gate, which is equivalent in constant depth to an (n + 1)-qubit fanout gate. We also observe that evolving the Hamiltonian for three qubits results in an inversion-on-three-way-equality gate, which together with single-qubit operations is universal for quantum c...

متن کامل

One-spin quantum logic gates from exchange interactions and a global magnetic field.

It has been widely assumed that one-qubit gates in spin-based quantum computers suffer from severe technical difficulties. We show that one-qubit gates can, in fact, be generated using only modest and presently feasible technological requirements. Our solution uses only global magnetic fields and controllable Heisenberg exchange interactions, thus circumventing the need for single-spin addressing.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004